adapt snipe volatil stabl continu doubl auction market learn classifi system ensembl rule dshare super comput heterogen classifi meta densembl comparison dwt fpaa dft time seri classif varianc stabil regress ensembl environment model autonom adapt agent singl seller seal bid auction develop open heterogen distribut multi agent system research face problem facilit negoti bargain agent increasingli common auction mechan negoti multi agent system choic auction mechan bid strategi agent central import success agent model aim determin agent learn algorithm bid varieti singl seller auction structur static environ optim strategi exist complex environ optim strategi constantli chang paper present model singl seller auction describ adapt agent algorithm learn strategi repeat competit experi rang auction environ increas complex determin agent perform relat optim strategi case deduc relat case find uniform distribut pure reactiv agent base cliff zip algorithm continu doubl auction cda perform outperform case memori base agent base gjerstad dickhaut agent cda bit level represent time seri data mine shape base similar abstract clip process transform real valu seri sequenc bit repres data averag paper argu clip flexibl transform exploratori analysi larg time depend data set demonstr time seri store bit effici compress manipul assumpt discriminatori power clip seri asymptot equival achiev raw data unlik transform clip seri compar directli raw data seri show mean form tight lower bound metric euclidean dynam time warp distanc effici queri content clip data conjunct host algorithm statist test natur follow binari natur data seri experi illustr clip seri increasingli complex wai achiev result popular techniqu us represent demonstr fact result clip data consist achiev wavelet discret fourier transform compress ratio cluster queri content flexibl represent shown fact advantag variabl run length encod clip seri defin approxim kolmogorov complex perform agentp classifi system dadjust gradual approach agentp classifi system dadjust gradual approach likelihood ratio distanc measur similar fourier transform time seri bit level time seri represent implic similar search cluster abstract time seri ubiquit increasingli preval type data research effort devot time seri data mine recent data mine problem kei effect scalabl algorithm choos represent data high level represent time seri propos data mine work introduc techniqu base bit level approxim data represent import advantag exist techniqu uniqu advantag raw data directli compar reduc represent guarante lower bound euclidean distanc fact exploit produc faster exact algorithm similarli search addit demonstr represent time seri cluster scale larger dataset multiag model uk market electr gener cluster time seri clip data improv decis tree perform induct cluster dbase stratifi sampl cluster time seri arma model clip data agent model price price privat auction releas problem paper concern multi object releas problem monrp problem search base requir engin previou work consid singl object formul multi object formul possibl conflict object softwar engin wish optim argu multi object formul realist requir engin characteris presenc complex conflict demand softwar engin find suitabl balanc paper present result empir studi suitabl weight pareto optim genet algorithm nsga ii algorithm present evid support claim nsga ii suit monrp paper benchmark data size monrp trivial adapt agent bid simplifi model uk market electr cryptanalysi rotor machin genet algorithm 